A constant amortized time enumeration algorithm for independent sets in graphs with bounded clique number

In this study, we address the independent set enumeration problem. Although several efficient algorithms and careful analyses have been proposed for maximal sets, no fine-grained analysis has given non-maximal variant. As main result, propose an algorithm variant that runs in O(q) amortized time linear space, where q is clique number, i.e., maximum size of a input graph. Note works correctly even if exact value unknown. It optimal graphs with bounded such as, triangle-free graphs, bipartite planar degenerate nowhere dense F-free any fixed graph F, copy F as subgraph. Furthermore, slight modification our algorithm, can enumerate sets at most k same space complexity. This problem generalization original since equal to k=n.